Decoder side mv derivation and refinement

ABSTRACT

In a method for video decoding in a decoder, a first motion vector and a second motion vector for a first block in a current picture are received. The first motion vector is indicative of a first reference block in a first picture, and the second motion vector is indicative of a second reference block in a second picture. A bilateral template is generated based on a weighted combination of the first reference block and the second reference block. A refined first motion vector and a refined second motion vector are determined based on the bilateral template, reference blocks in the first picture and reference blocks in the second picture respectively. An initial motion vector of a second block that is ceded after the first block is determined according to at least one of the first motion vector and the second motion vector for the first block.

INCORPORATION BY REFERENCE

This application is a continuation of U.S. application Ser. No. 16/821,833, filed Mar. 17, 2020, which is a continuation of U.S. application Ser. No. 16/235,545, filed Dec. 28, 2018, which claims the benefit of priority to U.S. Provisional Application No. 62/693,060, “IMPROVEMENT FOR DECODER SIDE MV DERIVATION AND REFINEMENT” filed on Jul. 2, 2018, which is incorporated by reference herein in its entirety.

TECHNICAL FIELD

The present disclosure describes embodiments generally related to video coding.

BACKGROUND

The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.

Video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital video can include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as frame rate), of, for example 60 pictures per second or 60 Hz. Uncompressed video has significant bitrate requirements. For example, 1080p60 4:2:0 video at 8 bit per sample (1920×1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 GBytes of storage space.

One purpose of video coding and decoding can be the reduction of redundancy in the input video signal, through compression. Compression can help reduce the aforementioned bandwidth or storage space requirements, in some cases by two orders of magnitude or more. Both lossless and lossy compression, as well as a combination thereof can be employed. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When using lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The compression ratio achievable can reflect that: higher allowable/tolerable distortion can yield higher compression ratios.

Motion compensation can be a lossy compression technique and can relate to techniques where a block of sample data from a previously reconstructed picture part thereof (reference picture), after being spatially shifted in a direction indicated by a motion vector (MV henceforth), is used for the prediction of a newly reconstructed picture or picture part. In some cases, the reference picture can be the same as the picture currently under reconstruction. MVs can have two dimensions X and Y, or three dimensions, the third being an indication of the reference picture in use (the latter, indirectly, can be a time dimension).

In some video compression techniques, an MV applicable to a certain area of sample data can be predicted from other MVs, for example from those related to another area of sample data spatially adjacent to the area under reconstruction, and preceding that MV in decoding order. Doing so can substantially reduce the amount of data required for coding the MV, thereby removing redundancy and increasing compression. MV prediction can work effectively, for example, because when coding, an input video signal derived from a camera (known as natural video) there is a statistical likelihood that areas larger than the area to which a single MV is applicable move in a similar direction and, therefore, can in some cases be predicted using a similar motion vector derived from MVs of neighboring area. That results in the MV found for a given area to be similar or the same as the MV predicted from the surrounding MVs, and that in turn can be represented, after entropy coding, in a smaller number of bits than what would be used if coding the MV directly. In some cases, MV prediction can be an example of lossless compression of a signal (namely: the MVs) derived from the original signal (namely: the sample stream). In other cases, MV prediction itself can be lossy, for example because of rounding errors when calculating a predictor from several surrounding MVs.

Various MV prediction mechanisms are described in H.265/HEVC (ITU-T Rec. H.265, “High Efficiency Video Coding”, December 2016). Out of the many MV prediction mechanisms that H.265 offers, described here is a technique henceforth referred to as “spatial merge”.

Referring to FIG. 1, a current block (101) comprises samples that have been found by the encoder during the motion search process to be predictable from a previous block of the same size that has been spatially shifted. Instead of coding that MV directly, the MV can be derived from metadata associated with one or more reference pictures, for example from the most recent (in decoding order) reference picture, using the MV associated with either one of five surrounding samples, denoted A0, A1, and B0, B1, B2 (102 through 106, respectively). In H.265, the MV prediction can use predictors from the same reference picture that the neighboring block is using.

SUMMARY

Aspects of the disclosure provide methods and apparatuses for video coding. In some examples, an apparatus includes receiving circuitry and processing circuitry.

According to an aspect of the current disclosure, a method for video decoding in a decoder is provided. In the disclosed method, a first motion vector and a second motion vector are received for a first block in a current picture of a video. The first motion vector is indicative of a first reference block in a first picture, and the second motion vector is indicative of a second reference block in a second picture. The current picture is between the first picture and the second picture in the video. Next, a bilateral template is generated based on a weighted combination of the first reference block and the second reference block. A refined first motion vector is subsequently determined based on the bilateral ten plate and a first set of reference blocks in the first picture. The refined first motion vector indicates a first refined reference block in the first picture. Further, a refined second motion vector is determined based on the bilateral template and a second set of reference blocks in the second picture. The refined second motion vector indicates a second refined reference block in the second picture. An initial motion vector of a second block that is coded after the first block is determined according to at least one of the first motion vector and the second motion vector for the first block.

In some embodiments, the first block is included in the process of constructing a candidate list of candidate motion vector predictors for the second block. The first set of reference blocks includes the first reference block and eight reference blocks at different positions of the first reference block in the first picture, and the second set of reference blocks includes the second reference block and eight reference blocks at different positions of the second reference block in the second picture.

In some embodiments, determining the refined first motion vector includes determining a first minimum cost measure in the first set of reference blocks, and determining the refined second motion vector includes determining a second minimum cost measure in the second set of reference blocks. The cost measure includes at least one of a sum of absolute difference (SAD) measure, a mean square error (MSE) measure, a mean absolute difference (MAD) measure, or a matching-pixel count (MPC) measure.

In some embodiments, the first block is reconstructed according to the first refined motion vector that is indicative of the first refined reference block in the first picture, and the second refined motion vector that is indicative of the second refined reference block in the second picture.

The disclosed methods further includes applying a refinement interpolation filter during determination of the refined first or second motion vector, where the refinement interpolation filter has a filter length of Tap__(MC-DMVR), and applying a final motion compensation interpolation filter during reconstruction of the first block, where the final motion compensation interpolation filter has a filter length of Tap__(SR). In an example, 2×SR+Tap__(MC-DMVR)/2+Tap__(SR)/2=Tap__(MC), where the SR is a search range to determine the first set of reference blocks or the second set of reference blocks, respectively, and the Tap__(MC) is a filter length of a regular motion compensation interpolation filter that is applied when the first block is reconstructed based on the first motion vector and the second motion vector.

In some embodiments, the refinement interpolation filter has a vertical filter length and a horizontal filter length, and the vertical filter length is different from the horizontal filter length.

In an embodiment, the search range to determine the first or second set of reference blocks is an adaptive search range that is defined based on a block size of the first block. In yet another embodiment, a size of the search range is defined based on an area of the first block.

According to another aspect of the present disclosure, an apparatus is provided. The apparatus has processing circuitry. The processing circuitry is configured to perform the disclosed method for video coding.

Aspects of the disclosure also provide a non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform the method for video coding.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1 is a schematic illustration of a current block and its surrounding spatial merge candidates in one example.

FIG. 2 is a schematic illustration of a simplified block diagram of a communication system (200) in accordance with an embodiment.

FIG. 3 is a schematic illustration of a simplified block diagram of a communication system (300) in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified block diagram of an encoder in accordance with an embodiment.

FIG. 6 shows a block diagram of an encoder in accordance with another embodiment.

FIG. 7 shows a block diagram of a decoder in accordance with another embodiment.

FIG. 8 shows a schematic diagram that illustrates a decoder side motion vector refinement (DMVR) mode according to an embodiment.

FIG. 9 shows a schematic diagram that illustrates a coding and decoding order of coding blocks (CUs) according to an embodiment.

FIG. 10 shows a schematic diagram that illustrates pipeline stages associated with the DMVR mode according to an embodiment.

FIG. 11 shows a schematic diagram that illustrates an improved DMVR mode according to an embodiment.

FIG. 12 shows a schematic diagram that illustrates an efficient pipeline associated with the improved DMVR mode according to one embodiment.

FIG. 13 shows a flow chart outlining a decoding process according to an embodiment.

FIG. 14 is a schematic illustration of a computer system in accordance with an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

FIG. 2 illustrates a simplified block diagram of a communication system (200) according to an embodiment of the present disclosure. The communication system (200) includes a plurality of terminal devices that can communicate with each other, via, for example, a network (250). For example, the communication system (200) includes a first pair of terminal devices (210) and (220) interconnected via the network (250). In the FIG. 2 example, the first pair of terminal devices (210) and (220) performs unidirectional transmission of data. For example, the terminal device (210) may code video data (e.g., a stream of video pictures that are captured by the terminal device (210)) for transmission to the other terminal device (220) via the network (250). The encoded video data can be transmitted in the form of one or more coded video bitstreams. The terminal device (220) may receive the coded video data from the network (250), decode the coded video data to recover the video pictures and display video pictures according to the recovered video data. Unidirectional data transmission may be common in media serving applications and the like.

In another example, the communication system (200) includes a second pair of terminal devices (230) and (240) that performs bidirectional transmission of coded video data that may occur, for example, during videoconferencing. For bidirectional transmission of data, in an example, each terminal device of the terminal devices (230) and (240) may code video data (e.g., a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices (230) and (240) via the network (250). Each terminal device of the terminal devices (230) and (240) also may receive the coded video data transmitted by the other terminal device of the terminal devices (230) and (240), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data.

In the FIG. 2 example, the terminal devices (210), (220), (230) and (240) may be illustrated as servers, personal computers and smart phones but the principles of the present disclosure may be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network (250) represents any number of networks that convey coded video data among the terminal devices (210), (220), (230) and (240), including for example wireline (wired) and/or wireless communication networks. The communication network (250) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network (250) may be immaterial to the operation of the present disclosure unless explained herein below.

FIG. 3 illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

A streaming system ay include a capture subsystem (313), that can include a video source (301), for example a digital camera, creating for example a stream of video pictures (302) that are uncompressed. In an example, the stream of video pictures (302) includes samples that are taken by the digital camera. The stream of video pictures (302), depicted as a bold line to emphasize a high data volume when compared to encoded video data (304) (or coded video bitstreams), can be processed by an electronic device (320) that includes a video encoder (303) coupled to the video source (301). The video encoder (303) can include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data (304) (or encoded video bitstream (304)), depicted as a thin line to emphasize the lower data volume when compared to the stream of video pictures (302), can be stored on a streaming server (305) for future use. One or more streaming client subsystems, such as client subsystems (306) and (308) in FIG. 3 can access the streaming server (305) to retrieve copies (307) and (309) of the encoded video data (304). A client subsystem (306) can include a video decoder (310), for example, in an electronic device (330). The video decoder (310) decodes the incoming copy (307) of the encoded video data and creates an outgoing stream of video pictures (311) that can be rendered on a display (312) (e.g., display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data (304), (307), and (309) (e.g., video bitstreams) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. In an example, a video coding, standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC.

It is noted that the electronic devices (320) and (330) can include other components (not shown). For example, the electronic device (320) can include a video decoder (not shown) and the electronic device (330) can include a video encoder (not shown) as well.

FIG. 4 shows a block diagram of a video decoder (410) according to an embodiment of the present disclosure. The video decoder (410) can be included in an electronic device (430). The electronic device (430) can include a receiver (431) (e.g., receiving circuitry). The video decoder (410) can be used in the place of the video decoder (310) in the FIG. 3 example.

The receiver (431) may receive one or more coded video sequences to be decoded by the video decoder (410); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel (401), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver (431) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver (431) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (415) may be coupled in between the receiver (431) and an entropy decoder/parser (420) (“parser (420)” henceforth). In certain applications, the buffer memory (415) is part of the video decoder (410). In others, it can be outside of the video decoder (410) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder (410), for example to combat network jitter, and in addition another buffer memory (415) inside the video decoder (410), for example to handle playout timing. When the receiver (431) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (415) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer memory (415) may be required, can be comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depicted) outside of the video decoder (410).

The video decoder (410) may include the parser (420) to reconstruct symbols (421) from the coded video sequence. Categories of those symbols include information used to manage operation of the video decoder (410), and potentially information to control a rendering device such as a render device (412) (e.g., a display screen) that is not an integral part of the electronic device (430) but can be coupled to the electronic device (430), as was shown in FIG. 4. The control information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (420) may parse/entropy-decode the coded video sequence that is received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (420) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The parser (420) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth.

The parser (420) may perform an entropy decoding/parsing operation on the video sequence received from the buffer. memory (415), so as to create symbols (421).

Reconstruction of the symbols (421) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser (420). The flow of such subgroup control information between the parser (420) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (410) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (451). The scaler/inverse transform unit (451) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc., as symbol(s) (421) from the parser (420). The scaler/inverse transform unit (451) can output blocks comprising sample values, that can be input into aggregator (455).

In some cases, the output samples of the scaler/inverse transform (451) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit (452). In some cases, the intra picture prediction unit (452) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current picture buffer (458). The current picture buffer (458) buffers, for example, partly reconstructed current picture and/or fully reconstructed current picture. The aggregator (455), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit (452) has generated to the output sample information as provided by the scaler/inverse transform unit (451).

In other cases, the output samples of the scaler/inverse transform unit (451) can pertain to an inter coded, and potentially motion compensated block. In such a case, a motion compensation prediction unit (453) can access reference picture memory (457) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols (421) pertaining to the block, these samples can be added by the aggregator (455) to the output of the scaler/inverse transform unit (451) (in this case called the residual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory (457) front where the motion compensation prediction unit (453) fetches prediction samples can be controlled by motion vectors, available to the motion compensation prediction unit (453) in the form of symbols (421) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory (457) when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (455) can be subject to various loop filtering techniques in the loop filter unit (456). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video sequence (also referred to as coded video bitstream) and made available to the loop filter unit (456) as symbols (421) from the parser (420), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

The output of the loop filter unit (456) can be a sample stream that can be output to the render device (412) as well as stored in the reference picture memory (457) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. For example, once a coded pic lire corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, the parser (420)), the current picture buffer (458) can become a part of the reference picture memory (457), and a fresh current picture buffer can be reallocated before commencing the reconstruction of the following coded picture.

The video decoder (410) may perform decoding operations according to a predetermined video compression technology in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technology or standard and the profiles as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

In an embodiment, the receiver (431) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used h the video decoder (410) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on.

FIG. 5 shows a block diagram of a video encoder (503) according to an embodiment of the present disclosure. The video encoder (503) is included in an electronic device (520). The electronic device (520) includes a transmitter (540) (e.g., transmitting circuitry). The video encoder (503) can be used in the place of the video encoder (303) in the FIG. 3 example.

The video encoder (503) may receive video samples from a video source (501) (that is not part of the electronic device (520) in the FIG. 5 example) that may capture video image(s) to be coded by the video encoder (50). In another example, the video source (501) is a part of the electronic device (520).

The video source (501) may provide the source video sequence to be coded by the video encoder (503) the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (501) may be a storage device storing previously prepared video. In a videoconferencing system, the video source (501) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples.

According to an embodiment, the video encoder (503) may code and compress the pictures of the source video sequence into a coded video sequence (543) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of a controller (550). In some embodiments, the controller (550) controls other functional units as described below and is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller (550) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. The controller (550) can be configured to have other suitable functions that pertain to the video encoder (503) optimized for a certain system design.

In some embodiments, the video encoder (503) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder (530) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (533) embedded in the video encoder (503). The decoder (533) reconstructs the symbols to create the sample data in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory (534). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote) the content in the reference picture memory (534) is also bit exact between the local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is used in some related arts as well.

The operation of the “local” decoder (533) can be the same as of a “remote” decoder, such as the video decoder (410), which has already be described in detail above in conjunction with FIG. 4. Briefly referring also to FIG. 4, however, as symbols are available and encoding/decoding of symbols to a coded video sequence by an entropy coder (545) and the parser (420) can be lossless, the entropy decoding parts of the video decoder (410), including the buffer memory (415), and parser (420) may not be fully implemented in the local decoder (533).

An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. Only in certain areas a more detail description is required and provided below.

During operation, in some examples, the source coder (530) may perform motion compensated predictive coding, which codes an input picture predictively with reference to one or more previously-coded picture from the video sequence that were designated as “reference pictures”. In this manner, the coding engine (532) codes differences between pixel blocks of an input picture and pixel blocks of reference picture(s) that may be selected as prediction reference(s) to the input picture.

The local video decoder (533) may decode coded video data of pictures that may be designated as reference pictures, based on symbols created by the source coder (530). Operations of the coding engine (532) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG. 5), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder (533) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache (534). In this manner, the video encoder (503) may store copies of reconstructed reference pictures locally that have common content as the reconstructed reference pictures that will be obtained by a far-end video decoder (absent transmission errors).

The predictor (535) may perform prediction searches for the coding engine (532). That is, for a new picture to be coded, the predictor (535) may search the reference picture memory (534) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor (535) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor (535), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (534).

The controller (550) may manage coding operations of the source coder (530), including, for example, setting of parameters and subgroup parameters used for encoding the video data.

Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder (545). The entropy coder (545) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbols according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth.

The transmitter (540) may buffer the coded video sequence(s) as created by the entropy coder (545) to prepare for transmission via a communication channel (560), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (540) may merge coded video data from the video coder (503) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

The controller (550) may manage operation of the video encoder (503). During coding, the controller (550) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following picture types:

An Intra Picture (I picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of prediction. Some video codecs allow for different types of intra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block.

A bi-directionally predictive picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks' respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

The video encoder (503) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video encoder (503) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used.

In an embodiment, the transmitter (540) may transmit additional data with the encoded video. The source coder (530) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, and so on.

A video may be captured as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a given picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture under encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in the inter-picture prediction. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respectively, in display order) are used. A block in the current picture can be coded by a first motion vector that points to a first reference block in the first reference picture, and a second motion vector that points to a second reference block in the second reference picture. The block can be predicted by a combination of the first reference block and the second reference block.

Further, a merge mode technique can be used in the inter-picture prediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such as inter-picture predictions and intra-picture predictions are performed in the unit a blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures is partitioned into coding tree units (CTU) for compression, the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one luma CTB and two chroma CTBs. Each CTU can be recursively quadtree split into one or multiple coding units (CUs). For example, a CTU of 64×64 pixels can be split into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In an example, each CU is analyzed to determine a prediction type for the CU, such as an inter prediction type or an intra prediction type. The CU is split into one or more prediction units (PUs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction block (PB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the unit of a prediction block. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values (e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 6 shows a diagram of a video encoder (603) according to another embodiment of the disclosure. The video encoder (603) is configured to receive a processing block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a coded picture that is part of a coded video sequence. In an example, the video encoder (603) is used in the place of the video encoder (303) in the FIG. 3 example.

In an HEVC example, the video encoder (603) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples, and the like. The video encoder (603) determines whether the processing block is best coded using intra mode, inter mode, or bi-prediction mode using, for example, rate-distortion optimization. When the processing block is to be coded in intra mode, the video encoder (603) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder (603) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. In certain video coding technologies, merge mode can be an inter picture prediction submode where the motion vector is derived from one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present. In an example, the video encoder (603) includes other components, such as a mode decision module (not shown) to determine the mode of the processing blocks.

In the FIG. 6 example, the video encoder (603) includes the inter encoder (630), an intra encoder (622), a residue calculator (623), a switch (626), a residue encoder (624), a general controller (621), and an entropy encoder (625) coupled together as shown in FIG. 6.

The inter encoder (630) is configured to receive, the samples of the current block (e.g., a processing block), compare the block to one or more reference blocks in reference pictures (e.g., blocks in previous pictures and later pictures), generate inter prediction information (e.g., description of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g., predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information.

The intra encoder (622) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the sauce picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder (622) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks in the same picture.

The general controller (621) is configured to determine general control data and control other components of the video encoder (603) based on the general control data. In an example, the general controller (621) determines the mode of the block, and provides a control signal to the switch (626) based on the mode. For example, when the mode is the intra mode, the general controller (621) controls the switch (626) to select the intra mode result for use by the residue calculator (623), and controls the entropy encoder (625) to select the intra prediction information and include the intra prediction information in the bitstream; and when the mode is the inter mode, the general controller (621) controls the switch (626) to select the inter prediction result for use by the residue calculator (623), and controls the entropy encoder (625) to select the inter prediction information and include the inter prediction information in the bitstream.

The residue calculator (623) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder (622) or the inter encoder (630). The residue encoder (624) is configured to operate based on the residue data to encode the residue data to generate the transform coefficients. In an example, the residue encoder (624) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transform coefficients. The transform coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments, the video encoder (603) also includes a residue decoder (628). The residue decoder (628) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder (622) and the inter encoder (630). For example, the inter encoder (630) can generate decoded blocks based on the decoded residue data and inter prediction information, and the intra encoder (622) can generate decoded blocks based on the decoded residue data and the intra prediction information. The decoded blocks are suitably processed to generate decoded pictures and the decoded pictures can be buffered in a memory circuit (not shown) and used as reference pictures in some examples.

The entropy encoder (625) is configured to format the bitstream to include the encoded block. The entropy encoder (625) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder (625) is configured to include the general control data, the selected prediction information (e.g., intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi-prediction mode, there is residue information.

FIG. 7 shows a diagram of a video decoder (710) according to another embodiment of the disclosure. The video decoder (710) is configured to receive coded pictures that are part of a coded video sequence, and decode the coded pictures to generate reconstructed pictures. In an example, the video decoder (710) is used in the place of the video decoder (310) in the FIG. 3 example.

In the FIG. 7 example, the video decoder (710) includes an entropy decoder (771), an inter decoder (780) a residue decoder (773), a reconstruction module (774), and all intra decoder (772) coupled together as shown in FIG. 7.

The entropy decoder (771) can be configured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, for example, the mode in which a block is coded (such as, for example, intra mode, inter mode, bi-predicted mode, the latter two in merge submode or another submode), prediction information (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction by the intra decoder (772) or the inter decoder (780), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an example, when the prediction mode is inter or bi-predicted mode, the inter prediction information is provided to the inter decoder (780); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (772). The residual information can be subject to inverse quantization and is provided to the residue decoder (773).

The inter decoder (780) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information.

The intra decoder (772) is configured to receive the intra prediction information, and generate prediction results based on the intra prediction information.

The residue decoder (773) is configured to perform inverse quantization to extract de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder (773) may also require certain control information (to include the Quantizer Parameter (QP)), and that information may be provided by the entropy decoder (771) (data path not depicted as this may low volume control information only).

The reconstruction module (774) is configured to combine, in the spatial domain, the residual as output by the residue decoder (773) and the prediction results (as output by the inter or intra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture, which in turn may be part of the reconstructed video. It is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality.

It is noted that the video encoders (303), (503), and (603), and the video decoders (310), (410), and (710) can be implemented using any suitable technique. In an embodiment, the video encoders (303), (503), and (603), and the video decoders (310), (410), and (710) can be implemented using one or more integrated circuits. In another embodiment, the video encoders (303), (503), and (503), and the video decoders (310), (410), and (710) can be implemented using one or more processors that execute software instructions.

FIG. 8 shows a schematic diagram that illustrates a decoder side motion vector refinement (DMVR) mode according to an embodiment. Comparing to the merge mode that is shown in FIG. 1, the DMVR mode is another tool to improve/refine a motion vector (MV) based on starting points. The DMVR mode provides a bi-prediction operation. In the bi-prediction operation, in order to predict one block region, two prediction (or reference) blocks that are formed by using a first MV of list0 and a second MV of list1 respectively, are combined to form a single prediction signal (bilateral template). In the DMVR method, the two motion vectors of the bi-prediction are further refined by a bilateral template matching process. The bilateral template matching process is applied in the decoder to pedal a distortion-based search between the bilateral template and the reference samples (blocks) in the reference pictures to obtain a refined MV without transmission of additional motion information.

As shown in FIG. 8, a current block (802) can be predicted according to the DMVR mode in the decoder side. The DMVR mode can predict the current block (802) in two steps. In step 1, a bilateral template (804) is generated as a weighted combination (i.e., average) of the two prediction (or reference) blocks (806) and (808), according to a first initial (MV0) of list0 and a second initial (MV1) of list1, respectively. In step 2, the bilateral template matching operation calculates cost measures between the generated template (804) and reference blocks in sample regions (around the initial prediction block) in reference pictures. For example, a sample region (810) of a first reference picture and a sample region (812) of a second reference picture are included in FIG. 8. Reference blocks in sample region (810) can be included in list0 and reference blocks in sample region (812) can be included in list1. According to Joint Exploration Model (JEM), nine MV candidates can be included in each of list0 and list1. In each of list0 and list1, the nine MV candidates include the original MV, such as (MV0) in the list0, and 8 surrounding MVs with a one luma sample offset to the original MV in either the horizontal or vertical direction, or both. Each of the nine MV candidates in either list0 or list1 is indicative of a respective reference block.

In step 2, the bilateral template matching operation calculates a cost measure between the generated bilateral template (804) and each of the nine reference blocks in list0 and list1, respectively. For example, the bilateral template matching operation can obtain nine cost measures based on the bilateral template (804) and the nine reference blocks in the list0. In each of list0 and list1, a reference block that yields a minimum template cost is determined as an updated (refined) reference block, and a MV that is indicative of the updated reference block is considered as a refined (final) MV. The updated MV further replaces the initial MV to predict the current block (802). For example, a first refined (final) (MV0′) is generated in list0 and a second refined (final) (MV1′) is generated in list1, respectively. The first refined (MV0′) is indicative of a first refined reference block and the second refined (MV1′) is indicative a second refined reference block. The first refined reference block and the second refined reference block further can be applied to generate the final bi-prediction result to predict the current block (802).

In some embodiments, a sum of absolute differences (SAD) is used as the cost measure. In other embodiments, the cost measure can include a mean square error (MSE) measure, a mean absolute difference (MAD) measure, a matching-pixel count (MPC) measure, or the like.

In some embodiments, the DMVR mode can be applied for the merge mode of bi-prediction with one MV from a reference picture in the past and another from a reference picture in the future, without the transmission of additional syntax elements.

FIG. 9 shows a schematic diagram that illustrates a coding and decoding order of coding blocks (CUs) according to an embodiment. In FIG. 9, a spatial relationship between a current coding block and a previous block that is immediately coded before the current block are shown in examples (901) and (902). The decoding order is known by both encoder and decoder. When decoding the current block, such as a current block (908) in the example (902), normally MVs of the current block's spatial neighbors will be used as predictors for coding a MV of the current block (908). For example, MVs from the blocks decoded in the order of 0, 1, 2 in the example (902) can be used as predictor candidates for the current block (908) in the example (902). In both examples (901) and (902), a previous block (e.g., a block (906) in the example (901), and a block (910) in the example (902)) can be included in a candidate list of candidate MV predictors to predict a current block (e.g., a block (904) in the example (901) and a block (908) in the example (902)). In addition, a position of the previous block changes as a position of the current block changes. For example, the previous block and the current block are aligned in a diagonal direction in the example (901), and the previous block and the current block are aligned side to side in the example (902).

FIG. 10 shows a schematic diagram that illustrates pipeline stages associated with the DMVR mode according to an embodiment. The DMVR mode can perform the following three processes: (1) an initial MV (MV_init) is parsed and a reference blocks identified by the initial MV is prefetched for a current block; (2) the MV_init is refined to determine a final MV (MV_final) or refined MV through the bilateral template matching operation for the current block; and (3) motion compensation (MC) is performed with MV_final for the current block to reconstruct the current block. In the second process, a final or refined MV can be determined for each of one or more initial motion vectors. For example, a first motion vector that indicates a first reference block in a first picture and a second motion vector that indicates a second reference block in a second picture. In the third process, motion compensation can be performed based on the one or more final or refined motion vector.

As shown in FIG. 10, a coding unit 0 (CU0) is processed by the three processes at three time stages, e.g., from T0 to T2. In hardware pipeline design, it is more efficient to have each process work consecutively in different time stages so that within a certain period more CUs can be processed. However, if a final MV for CU0 is used as a predictor to generate an initial MV for coding unit 1 (CU1), the first process of parsing the initial MV and prefetching the reference block that is identified by the parsed initial MV for CU1 cannot be started until the MV_final of CU0 is determined in the second process. Therefore, the first process for CU1 cannot be started at T1. Similarly, coding units 2 (CU2) and 3 (CU3) cannot be started at T3 and TS, respectively, for example when a final MV for CU1 is used as a predictor to generate an initial MV for CU2, and a final MV for CU2 is used as a predictor to generate an initial MV for CU3. As described above, the processes to be performed on subsequent coding units in the DMVR mode require access to a reconstructed neighboring block. This results in delays in starting the processes for the subsequent coding units to allow time for the required neighboring blocks to be reconstructed.

In FIG. 11, an improved DMVR mode is provided according to one embodiment. In the improved DMVR mode, when the previously decoded block (CU_prev) that is coded right before the current block is included in the process of constructing the candidate list of candidate MV predictors for the current block, an MV_init (i.e., MV before refinement) rather than a final, or refined, MV (i.e., MV_final, or MV after refinement) for the CU_prev is applied as the candidate. Accordingly, the MV parsing process the current block (CU_cur) and/or prefetching of reference samples for the CU_cur does not need to wait until the MV refinement of CU_prev to finish. As shown in FIG. 11, a current block can be CU1, and a previously coded block can be CU0. In the improved DMVR mode, when CU0 is included in the process of constructing the candidate list of candidate MV predictors for CU1, an MV_init rather than MV_final of CU0 can be applied as the candidate to determine an MV_init of the current block CU1. Similarly, in the improved DMVR mode, when CU1 is included in the process of constructing the candidate list of MV predictors for CU2, MV_init rather than MV_final for CU1 can be applied as the candidate to determine an MV_init for the current block CU2. As noted above, in the second process, a final or refined MV can be determined for each of one or more initial motion vectors. For example, a first motion vector that indicates a reference block in a first picture and a second motion vector that indicates a reference block in a second picture. In the third process, motion compensation can be performed based on the one or more final or refined motion vector.

FIG. 12 shows a schematic diagram that illustrates a more efficient pipeline associated with the improved DMVR mode according to an embodiment. As shown in FIG. 12, at T0, the MV_init for CU0 is determined. At T1, MV_init for CU0 can be further applied to determine the MV_init for CU1 if the CU0 is in the candidate list of the predictors for CU1. In addition, the MV_init for CU0 is refined through the DMVR mode at T1. At T2, a motion compensation based on the MV_final for CU0 can be applied to reconstruct the CU0. In the meanwhile, the MV_init for CU1 is refined through the DMVR mode at T2. Similar timings for the processes can be applied to CU2, CU3, and so on, as illustrated in FIG. 12. By introduction of the improved DMVR mode, an efficient pipeline can be obtained and pipeline delay can be prevented or reduced.

In some embodiments, in order to keep a memory bandwidth requirement of the improved DMVR mode the same as a regular inter mode, for example as illustrated in FIG. 1, interpolation filters that are used in an MV refinement process and in a final motion compensation interpolation process can be designed with a special number of taps so that a following condition (1) is met

2×SR+Tap__(MC-DMVR)/2+Tap__(SR)/2==Tap__(MC)  (1)

where SR is a search range (in pixels) in the MV refinement process, Tap__(MC-DMVR) and Tap__(SR) are filter lengths (i.e., number of filter taps) of the interpolation filters applied during the MV refinement process of the improved DMVR mode and during the final motion compensation interpolation process for the improved DMVR mode, respectively. The Tap__(MC) represents a filter length of an interpolation filter used in a motion compensation interpolation for the regular inter mode that is illustrated in FIG. 1.

In some embodiments, the search range SR can be 2. The Tap__(SR) can be in a range from two to eight. Further, Tap__(MC) can be eight, and the Tap__(MC-DMVR) is a variable that is defined by the condition (1) mentioned above.

In the disclosed improved DMVR mode, in order to reduce memory access by the DMVR mode, different taps of interpolation filters can be applied for vertical and horizontal interpolation during the refinement process. In an embodiment, a number of taps for a vertical interpolation (i.e., the vertical filter length) is smaller (shorter) than a number of taps for a horizontal interpolation (i.e., the horizontal filter length.). For example, the vertical interpolation can use 6-tap filters while the horizontal interpolation can use 8-tap filters. In another embodiment, the vertical filter may be asymmetric. For example, a number of taps above a to-be-interpolated position can be M, a number of taps below the to-be-interpolated position can be N, and M may be smaller than N. The sum of M and N may be the same or different from the number of taps used in the horizontal interpolation filter.

In the disclosed improved DMVR mode, in order to reduce memory access by the DMVR mode, an adaptive search range can be applied during the MV refinement of the improved DMVR mode. In an embodiment, the search range can be determined based on a block size of the current block. When the block size of the current block is smaller than a threshold, a first search range is used. When the block size of the current block is larger or equal to the threshold, a second search range is used. The threshold(s) and the value(s) of search range(s) may be predefined or signaled in bitstreams, such as in an SPS, PPS or slice header. In an example, the threshold of the block size can be defined as 64 pixels. Accordingly, below the threshold, a 1-pixel search range is used. Otherwise, a 2-pixel search range is used. In another example, more than one threshold and more than two search ranges can be applied.

In another embodiment, the search range can be a rectangle, where a width and a height of the search rectangle are dependent on a width and a height of the current block. In one example, the width and the height of the search rectangle is proportional to the width and height of the current block. For example, when the current block has a width of 16 and a height of eight, the search range has a width of one and a height of ½ in terms of pixels. Similarly, a 32×64 block size can correspond to a search range with a width equal two and a height equal to four.

In another example, when the width of the current block is greater (or smaller) than a predefined or signaled threshold, the width of the search rectangle is equal to a first value. Otherwise, the width of the search rectangle is equal to a second value. For example, when the current block has a width less than a threshold of eight, the search range has a width that is equal to the first value of zero. Otherwise, the search range has a width equal to the second value of two. When the current block has a width larger than a threshold 64, the search range can have a width equal to the first value of zero. Otherwise, the search range has a width equal to the second value of two.

In yet another example, when the height of the current block is greater (or smaller) than a predefined or a signaled threshold, the height of the search rectangle is equal to a first value. Otherwise the height of the search rectangle is equal to a second value. For example, when the current block has a height less than a threshold of eight, the search range has a height that is equal to the first value of zero. Otherwise, the search range has a height equal to the second value of two. When the current block has a height larger than a threshold of 64, the search range can have a height equal to the first value of zero. Otherwise, the search ranges has a height equal to the second value of two.

In yet another embodiment, the size (area) of the search range is determined based on the area of the current block (i.e., the total number of pixels in the current block), in an example, when the area of the current block is greater (or smaller) than a predefined or signaled threshold, the area of the search rectangle is equal to a first value. Otherwise the area of the search rectangle is equal to a second value. For example, when the current block has an area less than a threshold of 64, the search rectangle can have an area equal to the first value of zero, otherwise the search rectangle can have an area equal to the second value of four. When the area of current block is greater than a threshold of 4096, the search rectangle can have an area equal to the first value of zero, otherwise the search rectangle has an area equal to the second value of 4.

In another example, the search range has a square shape where the length of (number of pixels along) each side is a square root of the area rounded to the nearest integer. For example, the area of the search range (in terms of pixels) can be 4, 16, etc.

In yet another example, the width to height ratio of the search range is the same as the width to height ratio of the current block. The width and height of the search range are calculated from the area of the search range and rounded to the nearest integer values. For example, the width to height ratio could be 1/32, 1/16, ⅛, ¼, ½, 1, 2, 4, 8, 16, or 32.

FIG. 13 shows a flow chart outlining a process (1300) according to an embodiment of the disclosure. The process (1300) can be used in the reconstruction of a block coded in intra mode, so to generate a prediction block for the block under reconstruction. In various embodiments, the process (1300) are executed by processing circuitry, such as the processing circuitty in the terminal devices (210), (220), (230) and (240), the processing circuitry that performs functions of the video encoder (303), the processing circuitry that performs functions of the video decoder (310), the processing circuitry that performs functions of the video decoder (410), the processing circuitry that performs functions of the intra prediction module (452), the processing circuitry that performs functions of the video encoder (503), the processing circuitry that performs functions of the predictor (535), the processing circuitry that performs functions of the intra encoder (622), the processing circuitry that performs functions of the intra decoder (772), and the like. In some embodiments, the process (1300) is implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process (1300). The process starts at (S1301) and proceeds to (S1310).

At step (S1310), a first motion vector and a second motion vector are received, or otherwise determined, for a first block in a current picture of a video. The first motion vector is indicative of a first reference block in a first picture, and the second motion vector is indicative of a second reference block in a second picture. The current picture being between the first picture and the second picture in the video sequence. In some embodiments, the first motion vector can be MV0 and the second motion vector can be MV1 that are illustrated with reference to FIG. 8.

At step (S1320), a bilateral template can be generated based on the first reference block and the second reference block. For example, the bilateral template can be generated based on a weight combination of the first and second reference blocks. For example, a first reference block (806), a second reference block (808), and a bilateral template (804) are illustrated in FIG. 8.

At step (S1330), a refined first motion vector is determined. The refined first motion vector can be determined based on the bilateral template and a first set of reference blocks in the first picture. The refined first motion vector indicates a first refined reference block in the first picture. A relined second motion vector is also determined. The refined second motion vector can be based on the bilateral template and a second set of reference blocks in the second picture. The refined second motion vector indicates a second refined reference block in the second picture. For example, a refined first motion vector (MV0′), a refined second motion vector (MV1′), a first refined reference block (814), and a second refined reference block (816) are illustrated in FIG. 8.

In step (S1340) of the process 1300, an initial motion vector of a second block is determined. The initial motion vector of the second block can be determined according to at least one of the first motion vector and the second motion vector for the first block. The second block is coded after the first block. Accordingly, the initial motion vector of the second block can be determined without waiting for the refined first and/or second motion vectors of the first block to be determined. For example, a second block (CU1) and a first block (CU0) are illustrated in FIG. 12.

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example, FIG. 14 shows a computer system (1400) suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like.

The components shown in FIG. 14 for computer system (1400) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system (1400).

Computer system (1400) may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard (1401), mouse (1402), trackpad (1403), touch screen (1410), data-glove (not shown), joystick (1405), microphone (1406), scanner (1407), camera (1408).

Computer system (1400) may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen (1410), data-glove (not shown), or joystick (1405), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers (1409), headphones (not depicted)), visual output devices (such as screens (1410) to include CRT screens, LCD screens, plasma screens, OLEO screens, each with or without touch screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output, virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system (1400) can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW (1420) with CD/DVD or the like media (1421), thumb-drive (1422), removable hard drive or solid state drive (1423), legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system (1400) can also include an interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses (1449) (such as, for example USB ports of the computer system (1400)); others are commonly integrated into the core of the computer system (1400) by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system (1400) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core (1440) of the computer system (1400).

The core (1440) can include one or more Central Processing Units (CPU) (1441), Graphics Processing Units (GPU) (1442), specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) (1443), hardware accelerators for certain tasks (1444), and so forth. These devices, along with Read-only memory (ROM) (1445), Random-access memory (1446), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like (1447), may be connected through a system bus (1448). In some computer systems, the system bus (1448) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus (1448), or through a peripheral bus (1449). Architectures for a peripheral bus include PCI, USB, and the like.

CPUs (1441), CPUs (1442), FPGAs (1443), and accelerators (1444) can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM (1445) or RAM (1446). Transitional data can be also be stored in RAM (1446), whereas permanent data can be stored for example, in the internal mass storage (1447). Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU (1441), CPU (1442), mass storage (1447), ROM (1445), RAM (1446), and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system having architecture (1400), and specifically the core (1440) can provide functionality as a result processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core (1440) that are of non-transitory nature, such as core-internal mass storage (1447) or ROM (1445). The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core (1440). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core (1440) and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM (1446) and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator (1444)), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

APPENDIX A: ACRONYMS

JEM: joint exploration model VVC: versatile video coding BMS: benchmark set

MV: Motion Vector HEVC: High Efficiency Video Coding

SEI: Supplementary Enhancement information

VUI: Video Usability Information GOPs: Groups of Pictures TUs: Transform Units, PUs: Prediction Units CTUs: Coding Tree Units CTBs: Coding Tree Blocks PBs: Prediction Blocks HRD: Hypothetical Reference Decoder SNR: Signal Noise Ratio CPUs: Central Processing Units GPUs: Graphics Processing Units CRT: Cathode Ray Tube LCD: Liquid-Crystal Display OLED: Organic Light-Emitting Diode CD: Compact Disc DVD: Digital Video Disc ROM: Read-Only Memory RAM: Random Access Memory

ASIC: Application-Specific integrated Circuit

PLD: Programmable Logic Device LAN: Local Area Network

GSM: Global System for Mobile communications

LTE: Long-Term Evolution CANBus: Controller Area Network Bus USB: Universal Serial Bus PCI: Peripheral Component Interconnect FPGA: Field Programmable Gate Areas

SSD: solid-state drive

IC: Integrated Circuit CU: Coding Unit

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof. 

What is claimed is:
 1. A method for video decoding in a decoder, comprising: receiving a first motion vector and a second motion vector for a first block in a current picture of a video, the first motion vector being indicative of a first reference block in a first picture, and the second motion vector being indicative of a second reference block in a second picture; generating a bilateral template basal on a weighted combination of the first reference block and the second reference block; determining a refined first motion vector based on the bilateral template and a first set of reference blocks in the first picture; determining a refined second motion vector based on the bilateral template and a second set of reference blocks in the second picture; and reconstructing, by applying a final motion compensation interpolation filter, the first block according to (i) the refined first motion vector, and (ii) the refined second motion vector, wherein the determining the refined first motion vector and the determining the refined second motion vector are performed by applying a refinement interpolation filter.
 7. The method of claim 1, wherein the first block is included in a process of constructing a candidate list of candidate motion vector predictors for a second block that is coded after the first block, and prior to reconstructing the first block, the method further includes determining an initial motion vector of the second block according to at least of the first motion vector and the second motion vector for the first block.
 3. The method of claim 1, wherein the first set of reference blocks includes the first reference block and eight reference blocks at different positions of the first reference block in the first picture, and the second set of reference blocks includes the second reference block and eight reference blocks at different positions of the second reference block in the second picture.
 4. The method of claim 1, wherein the determining the refined first motion vector includes determining a first minimum cost measure in the first set of reference blocks, and the determining the refined second motion vector includes determining a second minimum cost measure in the second set of reference blocks.
 5. The method of claim 4, wherein a cost measure for determining the first minimum cost measure and the second minimum cost measure comprises at least one of a sum of absolute difference (SAD) measure, a mean square error (MSE) measure, a mean absolute difference (MAD) measure, or a matching-pixel count (MPC) measure.
 6. The method of claim 1, wherein the refinement interpolation filter and the final motion compensation interpolation filter have respective filter lengths determined based on a search range to determine the first set of reference blocks or the second set of reference blocks, and a filter length of a regular motion compensation interpolation filter that is applied when the first block is reconstructed based on the first motion vector and the second motion vector.
 7. The method of claim 6, wherein the filter length of the refinement interpolation filter is Tap__(MC-DMVR), the filter length of the final motion compensation interpolation filter is Tap__(SR), 2×SR+Tap__(MC-DMVR)/2+Tap__(SR)/2=Tap__(MC), SR is the search range to determine the first set of reference blocks or the second set of reference blocks, and Tap__(MC) is the filter length of the regular motion compensation interpolation filter that is applied when the first block is reconstructed based on the first motion vector and the second motion vector.
 8. The method of claim 6, wherein the refinement interpolation filter has a vertical filter length and a horizontal filter length, and the vertical filter length is different from the horizontal filter length.
 9. The method of claim 6, wherein the search range to determine the first or second set of reference blocks is an adaptive search range that is defined based on a block size of the first block.
 10. The method of claim 6, wherein a size of the search range is defined based on an area of the first block.
 11. An apparatus, comprising: processing circuitry configured to: receive a first motion vector and a second motion vector for a first block in a current picture of a video, the first motion vector being indicative of a first reference block in a first picture, and the second motion vector being indicative of a second reference block in a second picture; generate a bilateral template based on a weighted combination of the first reference block and the second reference block; determine a refined first motion vector based on the bilateral template and a first set of reference blocks in the first picture; determine a refined second motion vector based on the bilateral template and a second set of reference blocks in the second picture; reconstruct, by application of a final motion compensation interpolation filter, the first block according to (i) the refined first motion vector and (ii) the refined second motion vector, wherein the determining the refined first motion vector and the determining the refined second motion vector are performed by applying a refinement interpolation filter.
 12. The apparatus of claim 11, wherein the first block is included in a process of constructing a candidate list of candidate motion vector predictors for a second block that is coded after the first block, and prior to reconstructing the first block, the processing circuitry is configured to determine an initial motion vector of the second block according to at least one of the first motion vector and the second motion vector for the first block.
 13. The apparatus of claim 11, wherein the processing circuitry is further configured to: determine the refined first motion vector based on a first determination that the refined first motion vector is associated with a first minimum cost measure in the first set of reference blocks, and determine the refined second motion vector based on a second determination that the refined second motion vector is associated with a second minimum cost measure in the second set of reference blocks.
 14. The apparatus of claim 13, wherein a cost measure for determining the first minimum cost measure and the second minimum cost measure comprises at least one of a sum of absolute difference (SAD) measure, a mean square error (MSE) measure, a mean absolute difference (MAD) measure, or a matching-pixel count (MPC) measure.
 15. The apparatus of claim 11, wherein the refinement interpolation filter and the final motion compensation interpolation filter have respective filter lengths determined based on a search range to determine the first set of reference blocks or the second set of reference blocks, and a filter length of a regular notion compensation interpolation filter that is applied when the first block is reconstructed based on the first motion vector and the second motion vector.
 16. The apparatus of claim 15, wherein the filter length of the refinement interpolation filter is Tap__(MC-DMVR), the filter length of the final motion compensation interpolation filter is Tap__(SR), 2×SR+Tap__(MC-DMVR)/2+Tap__(SR)/2=Tap__(MC), SR is the search range to determine the first set of reference blocks or the second set of reference blocks, and Tap__(MC) is the filter length of the regular motion compensation interpolation filter that is applied when the first block is reconstructed based on the first motion vector and the second motion vector.
 17. The apparatus of claim 15, wherein the refinement interpolation filter has a vertical filter length and a horizontal filter length, and the vertical filter length is different from the horizontal filter length.
 18. The apparatus of claim 15, wherein the search range to determine the first or second set of reference blocks is an adaptive search range that is defined based on a block size of the first block.
 19. The apparatus of claim 15, wherein a size of the search range is defined based on an area of the first block.
 20. A non-transitory computer-readable storage medium storing instructions, which, when executed by a computer for video decoding, cause the computer to perform a method comprising: receiving a first motion vector and a second motion vector for a first block in a current picture of a video the first motion vector being indicative of a first reference block in a first picture, and the second motion vector being indicative of a second reference block in a second picture; generating a bilateral template based on a weighted combination of the first reference block and the second reference block; determining a refined first motion vector based on the bilateral template and a first set of reference blocks in the first picture; determining a refined second motion vector based on the bilateral template and a second set of reference blocks in the second picture; and reconstructing, by applying a final motion compensation interpolation filter, the first block according to (i) the refined first notion vector, and (ii) the refined second motion vector, wherein the determining the refined first motion vector and the determining the refined second motion vector are performed by applying a refinement interpolation filter. 